On non-Turing models of computation
نویسندگان
چکیده
© 1997 John Wiley & Sons, Inc. John Casti received his Ph.D. in mathematics under Richard Bellman at the University of Southern California in 1970. He worked at the RAND Corporation in Santa Monica, CA, and served on the faculties of the University of Arizona, NYU, and Princeton before becoming one of the first members of the research staff at the International Institute for Applied Systems Analysis (IIASA) in Vienna, Austria. In 1986 he left IIASA to take up his current post as a Professor of Operations Research and System Theory at the Technical University of Vienna. He is also a resident member of the Santa Fe Institute in Santa Fe, New Mexico, USA. In addition to numerous technical articles and a number of research monographs, Professor Casti is the author of several volumes of trade science, including Paradigms Lost, Searching for Certainty, Complexification, and Would-Be Worlds. BY JOHN L. CASTI Computing the Uncomputable
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کامل- 1 - Natural Computation and Non - Turing Models of Computation
We propose certain non-Turing models of computation, but our intent is not to advocate models that surpass the power of Turing Machines (TMs), but to defend the need for models with orthogonal notions of power. We review the nature of models and argue that they are relative to a domain of application and are ill-suited to use outside that domain. Hence we review the presuppositions and context ...
متن کاملNatural computation and non-Turing models of computation
We propose certain non-Turing models of computation, but our intent is not to advocate models that surpass the power of Turing machines (TMs), but to defend the need for models with orthogonal notions of power. We review the nature of models and argue that they are relative to a domain of application and are ill-suited to use outside that domain. Hence we review the presuppositions and context ...
متن کاملHypercomputation and the Physical Church-Turing Thesis
A version of the Church-Turing Thesis states that every effectively realizable physical system can be defined by Turing Machines (‘Thesis P’); in this formulation the Thesis appears an empirical, more than a logico-mathematical, proposition. We review the main approaches to computation beyond Turing definability (‘hypercomputation’): supertask, non-well-founded, analog, quantum, and retrocausal...
متن کاملSuper-Turing or Non-Turing? Extending the Concept of Computation
“Hypercomputation” is often defined as transcending Turing computation in the sense of computing a larger class of functions than can Turing machines. While this possibility is important and interesting, this paper argues that there are many other important senses in which we may “transcend Turing computation.” Turing computation, like all models, exists in a frame of relevance, which underlies...
متن کاملHow We Think of Computing Today
Classical models of computation no longer fully correspond to the current notions of computing in modern systems. Even in the sciences, many natural systems are now viewed as systems that compute. Can one devise models of computation that capture the notion of computing as seen today and that could play the same role as Turing machines did for the classical case? We propose two models inspired ...
متن کامل